Fast PDA Synchronization Using Characteristic Polynomial Interpolationy
نویسندگان
چکیده
Modern Personal Digital Assistant (PDA) architectures often use a wholesale data transfer protocol known as “slow sync” for synchronizing PDAs with Personal Computers (PCs). This approach is markedly inefficient, in terms of bandwidth usage and latency, since the PDA and PC typically share many common records. We propose, analyze, and implement a novel PDA synchronization scheme (CPIsync) based on recent information-theoretic research. The salient property of this scheme is that its communication complexity depends only on the number of differences between the PDA and PC, rather than the overall sizes of their databases. Moreover, our implementation shows that the computational complexity of CPIsync is practical, and that the overall latency is typically much smaller than that of slow sync. Thus, CPIsync has potential for significantly improving synchronization protocols for PDAs and, more generally, for heterogeneous networks of many machines. Keywords—Personal Digital Assistant, mobile computing, data synchronization
منابع مشابه
Fast PDA Synchronization Using Characteristic Polynomial Interpolation
Modern Personal Digital Assistant (PDA) architectures often utilize a wholesale data transfer protocol known as “slow sync” for synchronizing PDAs with Personal Computers (PCs). This approach is markedly inefficient with respect to bandwidth usage and latency, since the PDA and PC typically share many common records. We propose, analyze, and implement a novel PDA synchronization scheme (CPIsync...
متن کاملData Synchronization in Mobile and Distributed Networks
The rapid increase in networked mobile devices has made it important to develop scalable data synchronization protocols that will periodically synchronize data held on these devices. Synchronization seeks to maintain consistency in data that is being changed on each of these mobile hosts independently. This has to be achieved within practical constraints on overhead that limit the amount of dat...
متن کاملEfficient Synchronization of Multiple Databases over Broadcast Networks
This work deals with the problem of synchronizing multiple distributed databases over a broadcast network, such as satellite networks. The proposed method is based on introducing network coding techniques besides extending the well-known database reconciliation algorithm, the characteristic polynomial interpolation-based synchronization (CPISync). One key element is to elect a master node that ...
متن کاملA Polynomial Rooting Approach for Synchronization in Multipath Channels Using Antenna Arrays
The estimation of the delay of a known training signal received by an antenna array in a multipath channel is addressed. The effect of the co-channel interference is taken into account by including a term with unknown spatial correlation. The channel is modeled as an unstructured FIR filter. The exact maximum likelihood (ML) solution for this problem is derived, but it does not have a simple de...
متن کاملRelationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...
متن کامل